Coalgebraic Expressions
نویسنده
چکیده
We show that certain fixpoint expressions used to describe finite Kripke polynomial coalgebras can be seen as coalgebraic modal fixpoint formulae. Both the synthesis of a coalgebra from its expression and the ability to check behavioural equivalence follow from the same tableau construction. There is an associated complete equational logic, analogous to Kleene algebra, which may now be seen as an equational presentation of a fragment of the coalgebraic μ-calculus. These expressions include the regular expressions, the free Kleene algebra with tests and fragments of CCS and Linear Temporal Logic.
منابع مشابه
A coalgebraic approach to Kleene algebra with tests
Kleene algebra with tests is an extension of Kleene algebra, the algebra of regular expressions, which can be used to reason about programs. We develop a coalgebraic theory of Kleene algebra with Tests, along the lines of the coalgebraic theory of regular expressions based on deterministic automata. Since the known automata-theoretic presentation of Kleene algebra with tests does not lend itsel...
متن کاملA Bialgebraic Review of Regular Expressions, Deterministic Automata and Languages
This papers reviews the classical theory of deterministic automata and regular languages from a categorical perspective. The basis is formed by Rutten's description of the Brzozowski automaton structure in a coalgebraic framework. We enlarge the framework to a so-called bialgebraic one, by including algebras together with suitable distributive laws connecting the algebraic and coalgebraic struc...
متن کاملCoalgebraic Semantics of an Imperative Class Based Language
We study two observational equivalences of Fickle programs. Fickle is a class-based object oriented imperative language, which extends Java with object re-classification. The first is a contextual equivalence of expressions with respect to a given program. We provide an adequate coalgebraic semantics for it, which is compositional w.r.t. the operators of the language. The second observational e...
متن کاملA Specification Language for Reo Connectors
Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. Reo is a model of component coordination, wherein complex connectors are constructed by composing various types of primitive channels. Reo automata are a simple and intuitive formal model of contextdependent connectors, which provided a compositional semantics fo...
متن کاملCoalgebraic Characterizations of Context-Free Languages
In this article, we provide three coalgebraic characterizations of the class of context-free languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying output-derivative pairs. Final coalgebra semantics then gives an interpretation function into the final coalgebra of all languages with the usual output and derivative operations. The first...
متن کامل